Almost structural completeness; an algebraic approach
نویسندگان
چکیده
منابع مشابه
Almost structural completeness; an algebraic approach
The notion of structural completeness has received considerable attention for many years. A translation to algebra gives: a quasivariety is structurally complete if it is generated by its free algebras. It appears that many deductive systems (quasivarieties), like S5 or MVn fails structural completeness for a rather immaterial reason. Therefore the adjusted notion was introduced: almost structu...
متن کاملOn structural completeness versus almost structural completeness problem: A discriminator varieties case study
We study the following problem: Determine which almost structurally complete quasivarieties are structurally complete. We propose a general solution to this problem and then a solution in the semisimple case. As a consequence, we obtain a characterization of structurally complete discriminator varieties. An interesting corollary in logic follows: Let L be a propositional logic/deductive system ...
متن کاملAlgebraic Totality, towards Completeness
Finiteness spaces constitute a categorical model of Linear Logic whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefschetz in 1942) and morphisms as continuous linear maps. First, we recall definitions of finiteness spaces and describe their basic properties deduced from the general theory of linearly topologised spaces. Then we give...
متن کاملAn Algebraic Approach to Structural Learning Bayesian Networks
The basic idea of the paper is that every Bayesian network (BN) model is uniquely described by a certain integral vector, named a standard imset. Every score equivalent decomposable criterion Q for learning BN models appears to be an affine function of the standard imset. The algebraic view can naturally be extended to databases: if a criterion Q of the above mentioned kind is fixed then every ...
متن کاملCompleteness of algebraic CPS simulations
The algebraic lambda calculus (λalg) and the linear algebraic lambda calculus (λlin) are two extensions of the classical lambda calculus with linear combinations of terms. They arise independently in distinct contexts: the former is a fragment of the differential lambda calculus, the latter is a candidate lambda calculus for quantum computation. They differ in the handling of application argume...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2016
ISSN: 0168-0072
DOI: 10.1016/j.apal.2016.03.002